Throughput Analysis of Arq Schemes Using State Transition Diagrams

State Transition Diagrams

State transition diagrams are a graphic notation that has long been used to represent computing systems. Two basic models of state transition diagrams were introduced simultaneously by G.H. Mealy and E.F. Moore in the mid fifties, and have played a major role in hardware design for a long time. These basic models have been expanded significantly in the recent past to include such features as th...

Algebraic State Transition Diagrams

This paper introduces a graphical notation called algebraic state transition diagrams (ASTD), which allows for the combination of state transition diagrams using classical process algebra operators like sequence, iteration, parallel composition, quantified choice and quantified synchronization. It is inspired from automata, statecharts and process algebras. Hence, it combines the strength of al...

UML Analysis Using State Diagrams

This article demonstrates a new approach to analyzing UML designs using state and sequence diagrams. From multiple state diagrams, a super-state diagram which includes the cross-product of the selected states is built along with a transition matrix of possible transitions. The closure of the transition matrix is used to identify unreachable states and impossible transitions. Additionally, the c...

SHERBROOKE Algebraic State Transition Diagrams

This paper introduces a graphical notation called algebraic state transition diagrams (ASTD), which allows for the combination of state transition diagrams using classical process algebra operators like sequence, iteration, parallel composition, quantified choice and quantified synchronization. It is inspired from automata, statecharts and process algebras. Hence, it combines the strength of al...

State Transition Diagrams Radu Grosu